Combinatorial model and bounds for target set selection
نویسندگان
چکیده
منابع مشابه
Combinatorial model and bounds for target set selection
The adoption of everyday decisions in public affairs, fashion, movie-going, and consumer behavior is now thoroughly believed to migrate in a population through an influential network. The same diffusion process when being imitated by intention is called viral marketing. This process can be modeled by a (directed) graph G = (V,E) with a threshold t(v) for every vertex v ∈ V , where v becomes act...
متن کاملImproved Algorithms and Combinatorial Bounds for Independent Feedback Vertex Set
In this paper we study the “independent” version of the classic Feedback Vertex Set problem in the realm of parameterized algorithms and moderately exponential time algorithms. More precisely, we study the Independent Feedback Vertex Set problem, where we are given an undirected graph G on n vertices and a positive integer k, and the objective is to check if there is an independent feedback ver...
متن کاملTarget set selection problem for honeycomb networks
Let G be a graph with a threshold function θ : V (G) → N such that 1 ≤ θ(v) ≤ dG(v) for every vertex v of G, where dG(v) is the degree of v in G. Suppose we are given a target set S ⊆ V (G). The paper considers the following repetitive process on G. At time step 0 the vertices of S are colored black and the other vertices are colored white. After that, at each time step t > 0, the colors of whi...
متن کاملOn Approximating Target Set Selection
We study the Target Set Selection (TSS) problem introduced by Kempe, Kleinberg, and Tardos (2003). This problem models the propagation of influence in a network, in a sequence of rounds. A set of nodes is made “active” initially. In each subsequent round, a vertex is activated if at least a certain number of its neighbors are (already) active. In the minimization version, the goal is to activat...
متن کاملWeighted Target Set Selection on Social Networks
Viral marketing and influence maximization on social networks has become a problem of significant interest. We consider a problem in this setting referred to as the weighted target set selection (WTSS) problem. Earlier research focused on approximation algorithms for the unweighted case of the problem which is known to be NP-hard. Motivated by the desire to develop a better understanding of fun...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Theoretical Computer Science
سال: 2010
ISSN: 0304-3975
DOI: 10.1016/j.tcs.2010.08.021